Two slightly-entangled NP-complete problems
نویسندگان
چکیده
منابع مشابه
Two slightly-entangled NP-complete problems
We perform a mathematical analysis of the classical computational complexity of two genuine quantum-mechanical problems, which are inspired in the calculation of the expected magnetizations and the entanglement between subsystems for a quantum spin system. These problems, which we respectively call SES and SESSP, are specified in terms of pure slightly-entangled quantum states of n qubits, and ...
متن کاملTwo NP-Complete Problems in Software Security
A secure programming environment must offer protection mechanisms for regulating the interaction between mutually suspicious code units. Discretionary Capability Confinement (DCC) is a static type system recently proposed for expressing and enforcing access control policies in Java programs. This paper considers the computational complexity of the type reconstruction problem for DCC, that is, t...
متن کاملTwo-player entangled games are NP-hard
We show that the maximum success probability of players sharing quantum entanglement in a twoplayer game with classical questions of logarithmic length and classical answers of constant length is NP-hard to approximate to within constant factors. As a corollary, the inclusion NEXP ⊆ MIP∗, first shown in [IV12] with three provers, holds with two provers only. The proof is based on a simpler, imp...
متن کاملComplete Problems for Monotone NP
We show that the problem of deciding whether a digraph has a Hamiltonian path between two specified vertices and the problem of deciding whether a given graph has a cubic subgraph are complete for monotone NP via monotone projection translations. We also show that the problem of deciding whether a uniquely partially orderable (resp. comparability) graph has a cubic subgraph is complete for NP v...
متن کاملNP-Complete Stable Matching Problems
This paper concerns the complexity analysis of the roommate problem and intern assignment problem with couples. These are two special cases of the matching problems known as stable matching. The roommate problem is that of assigning a set of people to rooms of exactly two occupants in accordance with the preferences of the members of the set. The intern assignment problem with couples is that o...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Quantum Information and Computation
سال: 2005
ISSN: 1533-7146,1533-7146
DOI: 10.26421/qic5.6-3